High Order Masking of Look-up Tables with Common Shares
نویسندگان
چکیده
منابع مشابه
High Order Masking of Look-up Tables with Common Shares
Masking is an effective countermeasure against side-channel attacks. In this paper, we improve the efficiency of the high-order masking of look-up tables countermeasure introduced at Eurocrypt 2014, based on a combination of three techniques, and still with a proof of security in the Ishai-Sahai-Wagner (ISW) probing model. The first technique consists in proving security under the stronger t-SN...
متن کاملHigher Order Masking of Look-Up Tables
We describe a new algorithm for masking look-up tables of block-ciphers at any order, as a countermeasure against side-channel attacks. Our technique is a generalization of the classical randomized table countermeasure against first-order attacks. We prove the security of our new algorithm against t-th order attacks in the usual Ishai-Sahai-Wagner model from Crypto 2003; we also improve the bou...
متن کاملMasking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show that this countermeasure prevents side-channel attacks of all orders during the execution of a protected block cipher implementation, given that some secure precomputations can be performed. Second, we show that taking...
متن کاملA High Efficient Tables Look-up Algorithm for CAVLC Decoding
In order to solve the problems of high table memory access and long table look-up time and big table storage space in the process of CAVLC decoding for H.264/AVC, a high efficient table look-up algorithm is presented in this paper. The contribution of this paper lies that we uses a program method to realize fully the no-table looking-up of codeword. Specifically, after finding the relationships...
متن کاملHierarchical Compression of Color Look Up Tables
Color lookup tables (CLUTs) that are embedded in printer firmware consume precious flash memory. In order to conserve memory and thereby reduce cost, it is desirable to compress CLUTs prior to storage and restore tables as required. In this paper, we investigate methods for lossless compression of CLUTs. We demonstrate that, through suitable pre-processing of data, significant improvements in c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Cryptographic Hardware and Embedded Systems
سال: 2018
ISSN: 2569-2925
DOI: 10.46586/tches.v2018.i1.40-72